Separable integer partition classes
نویسندگان
چکیده
A classical method for partition generating function is developed into a tool with wide applications. New expansions of well-known theorems are derived, and new results partitions n n copies presented.
منابع مشابه
Restricted integer partition functions
For two sets A and M of positive integers and for a positive integer n, let p(n,A,M) denote the number of partitions of n with parts in A and multiplicities in M , that is, the number of representations of n in the form n = ∑ a∈Amaa where ma ∈M ∪{0} for all a, and all numbers ma but finitely many are 0. It is shown that there are infinite sets A and M so that p(n,A,M) = 1 for every positive int...
متن کاملUnsplittable Classes of Separable Permutations
A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutations both structurally and in terms of their bases.
متن کاملComputing the integer partition function
In this paper we discuss efficient algorithms for computing the values of the partition function and implement these algorithms in order to conduct a numerical study of some conjectures related to the partition function. We present the distribution of p(N) for N ≤ 109 for primes up to 103 and small powers of 2 and 3.
متن کاملEquipopularity Classes in the Separable Permutations
When two patterns occur equally often in a set of permutations, we say that these patterns are equipopular. Using both structural and analytic tools, we classify the equipopular patterns in the set of separable permutations. In particular, we show that the number of equipopularity classes for length n patterns in the separable permutations is equal to the number of partitions of the integer n− 1.
متن کاملThe complexity of Euler's integer partition theorem
Euler’s integer partition theorem stating that the number of partitions of an integer into odd integers is equal to the number of partitions into distinct integers ranks 16 in Wells’ list of the most beautiful theorems [17]. In this paper we use the algorithmic method to evaluate the complexity of mathematical statements developed in [3, 4, 5] to show that Euler’s theorem is in class CU,7, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2022
ISSN: ['2330-0000']
DOI: https://doi.org/10.1090/btran/87